Discovering simulation models

نویسندگان

  • Anne Rozinat
  • R. S. Mans
  • Minseok Song
  • Wil M. P. van der Aalst
چکیده

Process mining is a tool to extract non-trivial and useful information from process execution logs. These so-called event logs (also called audit trails, or transaction logs) are the starting point for various discovery and analysis techniques that help to gain insight into certain characteristics of the process. In this paper we use a combination of process mining techniques to discover multiple perspectives (namely, the control-flow, data, performance, and resource perspective) of the process from historic data, and we integrate them into a comprehensive simulation model. This simulation model is represented as a Coloured Petri net (CPN) and can be used to analyze the process, e.g., evaluate the performance of different alternative designs. The discovery of simulation models is explained using a running example. Moreover, the approach has been applied in two case studies; the workflows in two different municipalities in the Netherlands have been analyzed using a combination of process mining and simulation. Furthermore, the quality of the CPN models generated for the running example and the two case studies has been evaluated by comparing the original logs with the logs of the generated models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Price Discovering Models for Differentiated Wireless Services

Heterogeneous subscriber base with wide range of wireless services makes the wireless service market more challenging for a service provider (SP). This challenge is related to the revenue model of the SP, where pricing policy plays a central role. The pricing policy should be such that an SP will recover the investment while keeping the desired level of customer satisfaction. An ideal pricing p...

متن کامل

The Role of Abduction in Automatic Storytelling

Some researches state that discovering what to say is part of the writing process. We are interested in studying this aspect of writing within the scope of computer models. MEXICA is a computer model for plot generation which, inspired by the idea of the discovering aspect of writing, avoids the use of predefined story-structures and explicit characters’ goal. This work claims that abduction is...

متن کامل

Position Paper

Currently, there is a great need in communities, such as telecommunication network simulation and transportation systems simulation, to be able to publish/pull models to/off the Web and assemble and simulate a virtual configuration of choice by the end-user. For example, in Internet simulations, users would like to be able to search for the most efficient/relevant traffic source models, network...

متن کامل

Discovering Hidden Groups in Communication Networks1

This chapter presents statistical and algorithmic approaches to discovering groups of actors that hide their communications within the myriad of background communications in a large communication network. Our approach to discovering hidden groups is based on the observation that a pattern of communications exhibited by actors in a social group pursuing a common objective is different from that ...

متن کامل

Explanation and Connectionist Models

How do connectionist models explain? Connectionist models replace experiments that for ethical and pragmatic reasons we can’t do, and explore the abstract properties of complex brain-like networks, with the aim of discovering the mechanisms that give rise to cognition. Their mode of explanation is distinct from those of both classical AI, which uses inference to the best explanation; and from s...

متن کامل

Discovering Cyclic and Acyclic Causal Models by Independent Components Analysis

We generalize Shimizu et al’s (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, continuous-valued observational data. By relaxing the assumption that the generating SEM’s graph is acyclic, we solve the more general problem of linear non-Gaussian (LiNG) SEM discovery. In the large sample limit, LiNG discover...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Syst.

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2009